Integrality of minimal unit circular-arc models

نویسندگان

  • Francisco J. Soulignac
  • Pablo Terlisky
چکیده

A proper circular-arc (PCA) model is a pairM = (C,A) where C is a circle and A is a family of inclusion-free arcs on C in which no two arcs of A cover C. A PCA model U is a (c, `, d, ds)-CA model when C has circumference c, all the arcs in A have length `, all the extremes of the arcs in A are at a distance at least d, and all the beginning points of the arcs in A are at a distance at least d+ ds. If c ≤ c′ and ` ≤ `′ for every (c′, `′, d, ds)-CA model, then U is (d, ds)-minimal. In this article we prove that c and ` are integer combinations of d and ds when U is (d, ds)-minimal. As a consequence, we obtain an algorithm to compute a (d, ds)-minimal model equivalent to an input PCA modelM that runs in O(n3) time and O(n2) space.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal and short representations of unit interval and unit circular-arc graphs

We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) modelM is given and the goal is to obtain an equivalent UCA model U . We show a linear time algorithm with negative certification that can also be implemented to run in logspace. In the bounded version,M i...

متن کامل

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs

We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) modelM is given and the goal is to obtain an equivalent UCA model U . We show a linear time algorithm with negative certification that can also be implemented to run in logspace. In the bounded version,M i...

متن کامل

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory

This is the first of two chapters of a work in which we consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) modelM is given and the goal is to obtain an equivalent UCA model U . In the bounded version,M is given together with some lower and upper bounds that t...

متن کامل

On some subclasses of circular-arc graphs

The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc graphs. In this paper, all possible intersections of these subclasses are studied. There are thirteen regions. Twelve of these are nonempty, an...

متن کامل

The intersection between some subclasses of circular-arc and circle graphs

The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc graphs. The intersection graph of a family of chords in a circle is called a circle graph. Analogously, this class of graphs admits some subcla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1609.01266  شماره 

صفحات  -

تاریخ انتشار 2016